Global Optimization Problems in Computer Vision*

نویسندگان

  • P. SUSSNER
  • P. M. PARDALOS
  • G. X. RITTER
چکیده

In the field of computer vision, computer scientists extract knowledge from an image by manipulating it through image transforms. In the mathematical language of image algebra an image transformation often corresponds to an image-template product. When performing this operation on a computer, savings in time and memory as well as a better fit to the specific computer architecture can often be achieved by using the technique of template decomposition. In this paper we use global optimization techniques to solve a general problem of morphological template decomposition.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

COMPUTER CODES FOR COLLIDING BODIES OPTIMIZATION AND ITS ENHANCED VERSION

Colliding bodies optimization (CBO) is a new population-based stochastic optimization algorithm based on the governing laws of one dimensional collision between two bodies from the physics. Each agent is modeled as a body with a specified mass and velocity. A collision occurs between pairs of objects to find the global or near-global solutions. Enhanced colliding bodies optimization (ECBO) uses...

متن کامل

A Meta-heuristic Algorithm for Global Numerical Optimization Problems inspired by Vortex in fluid physics

One of the most important issues in engineering is to find the optimal global points of the functions used. It is not easy to find such a point in some functions due to the reasons such as large number of dimensions or inability to derive them from the function. Also in engineering modeling, we do not have the relationships of many functions, but we can input and output them as a black box. The...

متن کامل

An Optimization Approach for Using Contextual Information in Computer Vision

Local parallel processes are a very efficient way of using contextual information in a very large class of problems commonly encountered in Computer Vision. An approach to the design and analysis of such processes based on the minimization of a global criterion by local computation is presented.

متن کامل

Global Optimization and Approximation Algorithms in Computer Vision

Computer Vision is today a wide research area including topics like robot vision, image analysis, pattern recognition, medical imaging and geometric reconstruction problems. Over the past decades there has been a rapid development in understanding and modeling different computer vision applications. Even though much work has been made on modeling different problems, less work has been spent on ...

متن کامل

Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models

We show how certain nonconvex optimization problems that arise in image processing and computer vision can be restated as convex minimization problems. This allows, in particular, the finding of global minimizers via standard convex minimization schemes.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995